A Fault-Tolerant Token-Based Atomic Broadcast Algorithm
نویسندگان
چکیده
منابع مشابه
A Token-Based Distributed Algorithm for Total Order Atomic Broadcast
In this paper, we propose a new token-based distributed algorithm for total order atomic broadcast. We have shown that the proposed algorithm requires lesser number of messages compared to the algorithm where broadcast servers use unicasting to send messages to other broadcast servers. The traditional method of broadcasting requires 3(N − 1) messages to broadcast an application message, where N...
متن کاملReal-Time Fault-Tolerant Atomic Broadcast
We present algorithms for Real-Time Fault-Tolerance Uniform Atomic Broadcast developed in the framework of the French project ATR (accord temps réel). We first design a distributed execution model for asynchronous systems with crash failure we called Synchronized Phase System (SPS), then we give an algorithm for Atomic Broadcast in SPS. In a SPS, the processes try to run in synchronized rounds ...
متن کاملParsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast
Atomic broadcast is a communication primitive that allows a group of n parties to deliver a common sequence of payload messages despite the failure of some parties. We address the problem of asynchronous atomic broadcast when up to t < n/3 parties may exhibit Byzantine behavior. We provide the first protocol with an amortized expected message complexity of O(n) per delivered payload. The most e...
متن کاملRevisiting Token-Based Atomic Broadcast Algorithms
Many atomic broadcast algorithms have been published in the last twenty years. Token-based algorithms represent a large class of these algorithms. Interestingly all the token-based atomic broadcast algorithms rely on a group membership service, i.e., none of them uses failure detectors. The paper presents the first token-based atomic broadcast algorithm that uses an unreliable failure detector ...
متن کاملA Fault-Tolerant Token-Based Mutual Exclusion Algorithm Using a Dynamic Tree
This article presents a fault tolerant extension for the NaimiTrehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our approach minimizes the use of broadcast support by exploiting the distributed queue of token requests kept by the original algorithm. It also provides good fairness since, during failure recovery, it tries to preserve the order in w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Dependable and Secure Computing
سال: 2011
ISSN: 1545-5971
DOI: 10.1109/tdsc.2010.24